منابع مشابه
the role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولthe effect of consciousness-raising activities on learning grammatical structures by iranian guidance school efl learners
abstract the first purpose of this study was to investigate the effect of consciousness-raising (c-r) activities on learning grammatical structures (simple present tense in this case) by iranian guidance school efl learners. the second one was to investigate the effect of gender on learning the simple present tense through c-r activities and tasks. finally, this study aimed to investigate the ...
On Products of Elementarily indivisible Structures
A structure M in a first order language L is indivisible if for every colouring of its universe M in two colours, there is a monochromatic substructure M′ ⊆ M such that M′ ∼=M. Additionally, we say that M is symmetrically indivisible if M′ can be chosen to be symmetrically embedded inM (That is, every automorphism ofM′ can be can be extended to an automorphism of M), and that M is elementarily ...
متن کاملNeat Rings
A ring is called clean if every element is the sum of a unit and an idempotent. Throughout the last 30 years several characterizations of commutative clean rings have been given. We have compiled a thorough list, including some new equivalences, in hopes that in the future there will be a better understanding of this interesting class of rings. One of the fundamental properties of clean rings i...
متن کاملOn Computability Theoretic Properties of Structures and Their Cartesian Products
In this paper we show that for any set X ⊂ ω there exists a structure A that has no presentation computable in X such that A has a computable presentation. We also show that there exists a structure A with infinitely many computable isomorphism types such that A has exactly one computable isomorphism type.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1976
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-36-1-13-16